Palindrome complexity

Palindrome complexity bounds for primitive substitution sequences

We consider one-sided innnite words generated via iteration by primitive substitutions on nite alphabets and provide bounds on the palin-drome complexity function as well as uniform bounds on the frequencies of palindromes in such words. As an application of these bounds, we prove that the strongly palindromic sequences in a primitive substitution dynamical system form a set of measure zero. 1....

1 4 Ju n 20 01 Palindrome complexity

We study the palindrome complexity of infinite sequences on finite alphabets, i.e., the number of palindromic factors (blocks) of given length occurring in a given sequence. We survey the known results and obtain new results for some sequences, in particular for Rote sequences and for fixed points of primitive morphisms of constant length belonging to “class P” of Hof-Knill-Simon. We also give ...

. C O ] 1 4 Ju n 20 01 Palindrome complexity

We study the palindrome complexity of infinite sequences on finite alphabets, i.e., the number of palindromic factors (blocks) of given length occurring in a given sequence. We survey the known results and obtain new results for some sequences, in particular for Rote sequences and for fixed points of primitive morphisms of constant length belonging to “class P” of Hof-Knill-Simon. We also give ...

Random Palindrome Models

Palindrome Pattern Matching

A palindrome is a string that reads the same forward and backward. For a string x, let Pals(x) be the set of all maximal palindromes of x, where each maximal palindrome in Pals(x) is encoded by a pair (c, r) of its center c and its radius r. Given a text t of length n and a pattern p of length m, the palindrome pattern matching problem is to compute all positions i of t such that Pals(p) = Pals...